Consistency and General Solutions to Some Sylvester-like Quaternion Matrix Equations
نویسندگان
چکیده
This article makes use of simultaneous decomposition four quaternion matrixes to investigate some Sylvester-like matrix equation systems. We present useful necessary and sufficient conditions for the consistency system equations in terms equivalence form block matrixes. also derive general solution according partition coefficient As an application system, we practical a ϕ-Hermitian provide when is consistent. Moreover, numerical examples illustrate availability results this paper.
منابع مشابه
Accurate solutions of M-matrix Sylvester equations
This paper is concerned with a relative perturbation theory and its entrywise relatively accurate numerical solutions of an M -matrix Sylvester equation AX + XB = C by which we mean both A and B have positive diagonal entries and nonpositive off-diagonal entries and P = Im⊗A+B⊗ In is a nonsingular M -matrix, and C is entrywise nonnegative. It is proved that small relative perturbations to the e...
متن کاملRanks of the common solution to some quaternion matrix equations with applications
We derive the formulas of the maximal andminimal ranks of four real matrices $X_{1},X_{2},X_{3}$ and $X_{4}$in common solution $X=X_{1}+X_{2}i+X_{3}j+X_{4}k$ to quaternionmatrix equations $A_{1}X=C_{1},XB_{2}=C_{2},A_{3}XB_{3}=C_{3}$. Asapplications, we establish necessary and sufficient conditions forthe existence of the common real and complex solutions to the matrixequations. We give the exp...
متن کاملIterative Solutions to Some Linear Matrix Equations
In this paper the gradient based iterative algorithms are presented to solve the following four types linear matrix equations: (a) AXB = F ; (b) AXB = F, CXD = G; (c) AXB = F s. t. X = X ; (d) AXB+CY D = F, where X and Y are unknown matrices, A,B,C,D, F,G are the given constant matrices. It is proved that if the equation considered has a solution, then the unique minimum norm solution can be ob...
متن کاملIterative least-squares solutions of coupled Sylvester matrix equations
In this paper, we present a general family of iterative methods to solve linear equations, which includes the well-known Jacobi and Gauss–Seidel iterations as its special cases. The methods are extended to solve coupled Sylvester matrix equations. In our approach, we regard the unknown matrices to be solved as the system parameters to be identified, and propose a least-squares iterative algorit...
متن کاملControllability and nonsingular solutions of Sylvester equations
The singularity problem of the solutions of some particular Sylvester equations is studied. As a consequence of this study, a good choice of a Sylvester equation which is associated to a linear continuous time system can be made such that its solution is nonsingular. This solution is then used to solve an eigenstructure assignment problem for this system. From a practical point view, this study...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2022
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym14071350